The Intersection of Convex Transversals is a Convex Polytope
نویسندگان
چکیده
It is proven that the intersection of convex transversals of finitely many sets in R is a convex polytope, possibly empty. Related results on support hyperplanes and complements of finite unions of convex sets are given. MSC 2000: 52A20
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملSome results on functionally convex sets in real Banach spaces
We use of two notions functionally convex (briefly, F--convex) and functionally closed (briefly, F--closed) in functional analysis and obtain more results. We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$, then $bigcup_{alphain I}A_{alpha}$ is F--convex. Moreover, we introduce new definition o...
متن کاملPoisson Polytopes
We prove the central limit theorem for the volume and the f-vector of the Poisson random polytope η in a fixed convex polytope P ⊂ R d. Here, η is the convex hull of the intersection of a Poisson process X of intensity η with P. 1. Introduction and main results. Let K ⊂ R d be a convex set of volume 1. Assume that X = X(η) is a Poisson point process in R d of intensity η. The intersection of K ...
متن کاملOn the development of the intersection of a plane with a polytope
Define a “slice” curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops on a plane without self-intersection. The key tool used is a generalization of Cauchy’s arm lemma to permit nonconvex “openings” of a planar convex chain.
متن کاملHard Lefschetz Theorem for Nonrational Polytopes
The Hard Lefschetz theorem is known to hold for the intersection cohomology of the toric variety associated to a rational convex polytope. One can construct the intersection cohomology combinatorially from the polytope, hence it is well defined even for nonrational polytopes when there is no variety associated to it. We prove the Hard Lefschetz theorem for the intersection cohomology of a gener...
متن کامل